Probability Density Function of the Euclidean Distance between Node Pairs in Rectangular Random Graphs and its Applications in MANETs
نویسندگان
چکیده
This paper focuses on the probability density function of the Euclidean distance between node pairs in rectangular random graphs. As the main achievement of the paper, a closed analytic formula of the probability density function of the Euclidean distance between node pairs in rectangular random graphs was obtained basing on combinatorial theory and asymptotic concept. Some lemmas, such as number of links in fixed radius random graphs, were deduced. These lemmas were also used to get some deductions meaningful to Mobile ad hoc Network (MANET) technologies, such as expected number of wireless links, expected node degree, etc. These lemmas were verified through simulations. The results of the paper are suggestive to researches in fields includes MANETs.
منابع مشابه
یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیکهای یادگیری معیار فاصله
Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...
متن کاملApplication of tests of goodness of fit in determining the probability density function for spacing of steel sets in tunnel support system
One of the conventional methods for temporary support of tunnels is to use steel sets with shotcrete. The nature of a temporary support system demands a quick installation of its structures. As a result, the spacing between steel sets is not a fixed amount and it can be considered as a random variable. Hence, in the reliability analysis of these types of structures, the selection of an appropri...
متن کاملA Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach
In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...
متن کاملComparsion Between Several Distributions of Exponential Family and Offering Their Features and Applications
In this paper, first, we investigate probability density function and the failure rate function of some families of exponential distributions. Then we present their features such as expectation, variance, moments and maximum likelihood estimation and we identify the most flexible distributions according to the figure of probability density function and the failure rate function and f...
متن کاملPeripheral Wiener Index of a Graph
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
متن کامل